n = list(input())
s = input()
f = [0]*10
for i in s:
f[ord(i)-48] +=1
j = 9
i = 0
while(i<len(n) and j>=0):
while j>=0 and f[j]==0:
j -= 1
if ord(n[i])-48 < j:
n[i] = j
f[j]-=1
i+=1
for i in n:
print(i,end="")#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vi vector<int>
#define pii pair<int,int>
#define vii vector<pii>
#define rep(i,a,b) for(int i=a; i<b; i++)
#define ff first
#define ss second
const ll M = 1e9+7;
const ll mm = 998244353;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
string n,m;
cin >> n >> m;
vector<char> v;
for(auto x: m){
v.push_back(x);
}
sort(v.begin(), v.end());
int temp = v.size()-1;
for(int i=0; i<n.length(); i++){
if(n[i] < v[temp]) {
n[i] = v[temp];
temp--;
if(temp < 0) break;
}
}
cout << n << "\n";
return 0;
}368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |